A Semidefinite Bound for Mixing Rates of Markov Chains
نویسنده
چکیده
We study the method of bounding the spectral gap of a reversible Markov chain by establishing canonical paths between the states. We provide examples where improved bounds can be obtained by allowing variable length functions on the edges. We give a simple heuristic for computing good length functions. Further generalization using multicommodity ow yields a bound which is an invariant of the Markov chain, and which can be computed at an arbitrary precision in polynomial time via semide nite programming. We show that, for any reversible Markov chain on n states, this bound is o by a factor of at most O(log2 n), and that this can be tight.
منابع مشابه
The Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملMixing times of Lozenge Tiling and Card Shuffling Markov Chains
We show how to combine Fourier analysis with coupling arguments to bound the mixing times of a variety of Markov chains. The mixing time is the number of steps a Markov chain takes to approach its equilibrium distribution. One application is to a class of Markov chains introduced by Luby, Randall, and Sinclair to generate random tilings of regions by lozenges. For an l×l region we bound the mix...
متن کاملSome Applications of Laplace Eigenvalues of Graphs∗
In the last decade important relations between Laplace eigenvalues and eigenvectors of graphs and several other graph parameters were discovered. In these notes we present some of these results and discuss their consequences. Attention is given to the partition and the isoperimetric properties of graphs, the max-cut problem and its relation to semidefinite programming, rapid mixing of Markov ch...
متن کاملMarkov chains and mixing times ( part 2 - coupling )
This week’s post continues last week’s discussion of Markov chains and mixing times, and introduces the idea of coupling as a method for estimating mixing times. We remark that some nice notes on the subject of coupling (and others) can be found on Steve Lalley’s web page – of particular relevance for our purposes here are the notes on “Convergence rates of Markov chains”. A more thorough and c...
متن کاملEigenvalues of non-reversible Markov chains: their connection to mixing times, reversible Markov chains, and Cheeger inequalities
We show a lower bound on mixing time for a non-reversible Markov chain in terms of its eigenvalues. This is used to show a bound on the real part of the complex-valued eigenvalues in terms of the realvalued eigenvalues of a related reversible chain, and likewise to bound the second largest magnitude eigenvalue. A myriad of Cheeger-like inequalities also follow for non-reversible chains, which e...
متن کامل